package 链表;
class ListNode{
    int val;
    ListNode next;
    ListNode(){}
    ListNode(int val){
        this.val = val;
    }
    ListNode(int val,ListNode next){
        this.val = val;
        this.next = next;
    }


}
public class 反转链表206递归 {
    public static void main(String[] args) {

    }

    public ListNode reverseList(ListNode head) {
        if(head==null||head.next==null){
            return head;
        }
        ListNode newHead =  reverseList(head.next);
        head.next.next = head;
        head.next = null;
        return newHead;
    }
    }
